package com.example.leetcode.queue_code;

import java.util.ArrayDeque;

class Solution {

    public int[] maxSlidingWindow(int[] nums, int k) {
       if(nums.length<1){
           return new int[0];
       }
//       int window,res=[],[];
        return null;
    }

    public static void main(String[] args) {
        int[] nums = {1, 3, -1, -3, 5, 3, 6, 7};
        int k=3;
        int[] result=   new Solution().maxSlidingWindow(nums,k);
         int [] ass={3,3,5,5,6,7};
        for (int i : result) {
            System.out.println(i);
        }
    }
}

//作者：LeetCode
//链接：https://leetcode-cn.com/problems/sliding-window-maximum/solution/hua-dong-chuang-kou-zui-da-zhi-by-leetcode-3/
//来源：力扣（LeetCode）
//著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。
